Inverse Multislice Ptychography by Layer-Wise Optimisation and Sparse Matrix Decomposition
نویسندگان
چکیده
We propose algorithms based on an optimisation method for inverse multislice ptychography in, e.g. electron microscopy. The is widely used to model the interaction between relativistic electrons and thick specimens. Since only intensity of diffraction patterns can be recorded, challenge in applying uniquely reconstruct electrostatic potential each slice up some ambiguities. In this conceptual study, we show that a unique separation atomic layers simulated data possible when considering low acceleration voltage. also introduce adaptation estimating illuminating probe. For sake practical application, finally present reconstructions using experimental 4D scanning transmission microscopy (STEM) data.
منابع مشابه
A Coordinate-wise Optimization Algorithm for Sparse Inverse Covariance Selection
Sparse inverse covariance selection is a fundamental problem for analyzing dependencies in high dimensional data. However, such a problem is difficult to solve since it is NP-hard. Existing solutions are primarily based on convex approximation and iterative hard thresholding, which only lead to sub-optimal solutions. In this work, we propose a coordinate-wise optimization algorithm to solve thi...
متن کاملSparse matrix decomposition with optimal load balancing
Optimal load balancing in sparse matrix decomposition without disturbing the row/column ordering is investigated. Both asymptotically and run-time efficient exact algorithms are proposed and implemented for one-dimensional (1D) striping and two-dimensional (2D) jagged partitioning. Binary search method is successfully adopted to 1D striped decomposition by deriving and exploiting a good upper b...
متن کاملRevisiting Hypergraph Models for Sparse Matrix Decomposition
We provide an exposition of the hypergraph models for parallel sparse matrix-vector multiplies based on one-dimensional (1D) matrix partitioning. Our aim is to emphasize the expressive power of the hypergraph models. We first set forth an elementary hypergraph model in which vertices represent the data elements of a matrix-vector multiply operation and nets encode data dependencies. We then app...
متن کاملDecomposition Methods for Sparse Matrix Nearness Problems
We discuss three types of sparse matrix nearness problems: given a sparse symmetric matrix, find the matrix with the same sparsity pattern that is closest to it in Frobenius norm and (1) is positive semidefinite, (2) has a positive semidefinite completion, or (3) has a Euclidean distance matrix completion. Several proximal splitting and decomposition algorithms for these problems are presented ...
متن کاملSpeech Denoising via Low - Rank and Sparse Matrix Decomposition
© 2014 Jianjun Huang et al. 167 http://dx.doi.org/10.4218/etrij.14.0213.0033 In this letter, we propose an unsupervised framework for speech noise reduction based on the recent development of low-rank and sparse matrix decomposition. The proposed framework directly separates the speech signal from noisy speech by decomposing the noisy speech spectrogram into three submatrices: the noise structu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE transactions on computational imaging
سال: 2022
ISSN: ['2333-9403', '2573-0436']
DOI: https://doi.org/10.1109/tci.2022.3218993